Congestion-Driven Multilevel Full-Chip Routing Framework
نویسنده
چکیده
A W-shaped multilevel full-chip routing framework using W-shaped optimization flow is used to find the final routing solution. The W-shaped flow consists of two sequential V-shaped optimization flows. The first V-shaped flow optimizes the global routing solution. The probabilistic congestion prediction technique is used to guide the global routing decision to find the routing solution that evenly distributes the nets. Then, the second V-shaped flow improves the quality of the routing result. Tests on a set of commonly used benchmark circuits and comparisons with other multilevel routing systems show that the routability, total wire length, total number of vias, and the runtime are all improved.
منابع مشابه
mSMART: A Signal-integrity-, MAnufacturing-, Reliability-, and Timing-Driven Multilevel Full-Chip Routing
To handle these challenges, I implemented a Signalintegrity-, MAnufacturing-, Reliability-, and Timing-driven multilevel routing system (mSMART) which the related publication are presented in some major EDA conferences. The rest of this abstract is organized as follows. Section 2 presents the multilevel routing framework. Section 3 presents a fast crosstalkand performancedriven multilevel routi...
متن کاملCongestion estimation of router input ports in Network-on-Chip for efficient virtual allocation
Effective and congestion-aware routing is vital to the performance of network-on-chip. The efficient routing algorithm undoubtedly relies on the considered selection strategy. If the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. In this paper, we introduce a new selection s...
متن کاملMultilevel global placement with congestion control
In this paper, we develop a multilevel global placement algorithm (MGP) integrated with fast incremental global routing for directly updating and optimizing congestion cost during physical hierarchy generation. Fast global routing is achieved using a fast two-bend routing and incremental A-tree algorithm. The routing congestion is modeled by the wire usage estimated by the fast global router. A...
متن کاملImplicit Heuristics to Mitigate Interconnect Congestion in a Multilevel Placement Framework
The congestion minimization techniques have become more important due to the shrinking geometries and “taller” interconnects, causing numerous design convergence problems. Also, multilevel placement algorithms are becoming more prevalant due to their ability to natively incorporate mixed-mode placement, in addition to their ability to scale to very large design sizes. In this context, we have d...
متن کاملPerformance Analysis of WK-Recursive and Torus Routing Algorithms for NoCs
Network on Chip (NoC), specific parameters such as topology, switching methods and routing algorithms, have a huge impact on performance and the cost of the NoCs. In this work, we propose a deterministic mirror routing algorithm for Torus topology and an adaptive routing for WK-recursive topology. To evaluate the routing algorithms, a complete NoC synthesizable framework was implemented in Veri...
متن کامل